Soundness of Q-resolution with dependency schemes
نویسندگان
چکیده
Article history: Received 1 December 2014 Received in revised form 16 May 2015 Accepted 9 October 2015 Available online 20 October 2015 Communicated by N. Shankar
منابع مشابه
Dependency Schemes in QBF Calculi: Semantics and Soundness
We study the parametrization of QBF resolution calculi by dependency schemes. One of the main problems in this area is to understand for which dependency schemes the resulting calculi are sound. Towards this end we propose a semantic framework for variable independence based on ‘exhibition’ by QBF models, and use it to define a property of dependency schemes called full exhibition. We prove tha...
متن کاملLong Distance Q-Resolution with Dependency Schemes
Resolution proof systems for quantified Boolean formulas (QBFs) provide a formal model for studying the limitations of state-of-the-art search-based QBF solvers that use these systems to generate proofs. We study a proof system that combines two proof systems supported by the solver DepQBF: Q-resolution with generalized universal reduction according to a dependency scheme and long distance Q-re...
متن کاملDependency Schemes and Q-resolution
We propose Q(D)-resolution, a proof system for Quantified Boolean Formulas. Q(D)-resolution is a generalization of Q-resolution parameterized by a dependency scheme D. This system is motivated by the generalization of the QDPLL algorithm using dependency schemes implemented in the solver DepQBF. We prove soundness of Q(D)-resolution for a dependency scheme D that is strictly more general than t...
متن کاملInternational Workshop on Quantified Boolean Formulas 2013 1 Informal Workshop Report 2
We propose Q(D)-resolution, a proof system for Quantified BooleanFormulas. Q(D)-resolution is a generalization of Q-resolution parameterized bya dependency scheme D. This system is closely related to search-based QCNFsolvers that use dependency schemes to generalize the QDPLL algorithm, suchas DepQBF. We prove thatQ(D)-resolution is sound by presenting a transfor-mation of Q...
متن کاملVariable Independence and Resolution Paths for Quantified Boolean Formulas
Variable independence in quantified boolean formulas (QBFs) informally means that the quantifier structure of the formula can be rearranged so that two variables reverse their outer-inner relationship without changing the value of the QBF. Samer and Szeider introduced the standard dependency scheme and the triangle dependency scheme to safely over-approximate the set of variable pairs for which...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 612 شماره
صفحات -
تاریخ انتشار 2016